Fault-tolerant Message Routing in Computer Networks
نویسندگان
چکیده
We are considering a problem of faulttolerant wormhole unicast routing in computer networks, consisting of nodes (processor units), connected by bi-directional links. Each node can be viewed as the combination of a router and a processor with some RAM, bus and I/O circuitry. We concentrate on networks with arbitrary (irregular) topologies. The problem of routing in the presence of faults is divided into two sub-problems: diagnosis and reconfiguration of the network and deadlock-free routing in the new network. In this paper we consider non-adaptive routing, not taking the sizes of corresponding message queues into account.
منابع مشابه
Energy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks
Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...
متن کاملA fault tolerance routing protocol considering defined reliability and energy consumption in wireless sensor networks
In wireless sensor networks, optimal consumptionof energy and having maximum life time are important factors. In this article attempt has been made to send the data packets with particular reliability from the beginning based on AODV protocol. In this way two new fields add to the routing packets and during routing and discovering of new routes, the lowest remained energy of nodes and route tra...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کاملA Fault-tolerant Routing Algorithm using Directed Probabilities in Hypercube Networks
In this paper, we propose a new fault-tolerant routing algorithm for hypercube networks based on directed probabilities. The directed probabilities are obtained by improving the probabilities proposed by Al-Sadi et al. The probability represents ability of routing to any node at a specific distance. Each node selects one of its neighbor nodes to send a message by taking the probabilities into c...
متن کاملFault-tolerant Routing Algorithms based on Approximate Routable Probabilities for Hypercube Networks
Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. One of the most popular topologies is a hypercube network. In this paper, we propose new fault-tolerant routing algorithms for hypercube networks based on approximate routable probabilities. The probability represents ability of routing to any node at a specific distance. Each node ...
متن کامل